A convex set of robust D—stabilizing controllers using Cauchy's argument principle

نویسندگان

چکیده

A new approach is presented to obtain a convex set of robust D—stabilizing fixed structure controllers, relying on Cauchy's argument principle. controllers around an initial controller for multi-model represented by infinite Linear Matrix Inequalities (LMIs). By appropriate sampling the D—stability boundary, Semi-Definite Programming (SDP) proposed that can be integrated in other synthesis approaches ensure along design specifications. To showcase utility approach, two different examples are given: boost converter with uncertainty and laser-beam system modeled identified finite impulse response.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic modeling and control of a 4 DOF robotic finger using adaptive-robust and adaptive-neural controllers

In this research, first, kinematic and dynamic equations of a 4-DOF 3-link robotic finger are derived using Denavit-Hartenberg convention and Lagrange’s formulation. To model the muscles, several springs and dampers are placed between the finger links. Then, two advanced controllers, namely adaptive-robust and adaptive-neural, which can control the robotic finger in presence of parametric uncer...

متن کامل

Cutting-set methods for robust convex optimization with pessimizing oracles

We consider a general worst-case robust convex optimization problem, with arbitrary dependence on the uncertain parameters, which are assumed to lie in some given set of possible values.We describe a general method for solving such a problem, which alternates between optimization and worst-case analysis. With exact worst-case analysis, the method is shown to converge to a robust optimal point. ...

متن کامل

Convex set reconstruction using prior shape information

In this paper we present several algorithms for reconstructing 2D convex sets given support line measurements for which the angles are known precisely but the lateral displacements are noisy. We extend the algorithms given in a previous paper by explicitly incorporating prior information about the shape of the objects to be reconstructed. We develop the Scale-Invariant algorithms, which incorpo...

متن کامل

Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments

In this paper, we discuss the algorithm engineering aspects of an O(n 2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2022

ISSN: ['2405-8963', '2405-8971']

DOI: https://doi.org/10.1016/j.ifacol.2022.09.322